Parameterized complexity - PDFSEARCH.IO - Document Search Engine

Parameterized complexity
Results: 172

#	Item
81	Greedy Localization, Iterative Compression and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting and a Novel 2k Kernelization for Vertex Cover Frank Dehne1 , Mike Fellows2 , Frances Ro Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:09:48 NP-complete problems Parameterized complexity Kernelization Vertex cover Graph coloring Minimum k-cut Algorithm Independent set Greedy algorithm Theoretical computer science Mathematics Computational complexity theory
82	Research internship (Master M2) Title Verification of Distributed Systems with Parameterized Network Topology Description Add to Reading List Source URL: www.lsv.ens-cachan.fr Language: English - Date: 2014-10-03 08:24:08 Computational complexity theory Automata theory Symposium on Theoretical Aspects of Computer Science Cryptographic protocols Model checking Network topology
83	On Backdoors To Tractable Constraint Languages Clement Carbonnel1,3 , Martin C. Cooper2 , and Emmanuel Hebrard1 1 3 Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2014-05-28 03:24:32 Applied mathematics Parameterized complexity Constraint satisfaction problem Constraint satisfaction Idempotence Local consistency P versus NP problem Sheaf Complexity of constraint satisfaction Constraint programming Mathematics Theoretical computer science
84	Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-05 20:16:31 NP-complete problems Parameterized complexity Kernelization Dominating set Vertex cover Path decomposition Planar separator theorem Clique problem Graph coloring Theoretical computer science Graph theory Mathematics
85	Improved Parameterized Algorithms for Network Query Problems Ron Y. Pinter, Hadas Shachnai, and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {pinter,hadas,meizeh}@cs.technion.ac.il Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-03-05 14:37:49 Complexity classes NP-complete problems Parameterized complexity Tree decomposition Dynamic programming NP-hard NP Clique problem Theoretical computer science Computational complexity theory Graph theory
86	Journal of Artificial Intelligence Research Submitted 10/10; publishedSoft Constraints of Difference and Equality Emmanuel Hebrard Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2011-06-09 12:13:27 Computer programming Local consistency Constraint satisfaction Mathematical optimization FO Polynomial Parameterized complexity Decomposition method AC-3 algorithm Constraint programming Software engineering Theoretical computer science
87	Iterative Compression and Exact Algorithms Fedor V. Fomin∗ Serge Gaspers† Mathieu Liedloff§ Add to Reading List Source URL: www.dim.uchile.cl Language: English - Date: 2009-10-29 15:21:24 NP-complete problems Vertex cover Feedback vertex set Independent set Matching Maximal independent set Parameterized complexity Algorithm Dominating set Theoretical computer science Mathematics Computational complexity theory
88	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 On the parameterized complexity of a generalized Rush Hour puzzle ∗ H. Fernau† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:31 Puzzles Rush Hour Parameterized complexity PSPACE-complete Polynomial P Games Complexity classes Mechanical puzzles
89	WO RKSHO P O N PARAM ETERI ZED CO M PLEXI TY All lectures will take place in Engineering Quad, Building EF, Seminar Room EF122 http://www.fpt.wikidot.com Tuesday, 3 0 M archMorning Session. Chair: Frances Rosamo Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:50:14 Computational complexity theory Michael Fellows Parameterized complexity NP-complete problems Vertex cover Bioinformatics Theoretical computer science Applied mathematics Mathematics
90	Sponsored by Charles Darwin University (CDU), Northern Territory, AUSTRALIA PARAMETERIZED COMPLEXITY: NOT-ABOUT-GRAPHS! See website: www.cdu.edu.au/parameterized-nag and below. DESCRIPTION To date, much of the work in p Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:51:39 Ethology Parameterized complexity Darwin–Wedgwood family Fellows of the Royal Society Charles Darwin University Computational complexity theory Charles Darwin Largest-scale trends in evolution Northern Territory Science Michael Fellows Academia

UPDATE